A Simple Program Transformation for Parallelism
نویسندگان
چکیده
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class of commonly encountered computations whose \natural" speciica-tion is essentially sequential, and show how algebraic properties of the operators involved can be used to transform them into divide-and-conquer programs that are considerably more eecient, both in theory and in practice, on parallel machines.
منابع مشابه
Comments on Nonfinite Adverbial Patterns in English Prose Fiction: A Simple Model for Analysis and Use
This study aims to present an accessible model of some frequent nonfinite adverbial types occurring in English prose fiction. As its main syntactic argument, it recognizes that these adverbials are mostly elliptical in that there are some dependent-clause markers one can assume to be implicit when supplying those elements back into the clause complex. Some comments are provided at the end on th...
متن کاملExploiting Parallelism in Functional Languages : a \paradigm-oriented" Approach
Deriving parallelism automatically from functional programs is simple in theory but very few practical implementations have been realised. Programs may contain too little or too much parallelism causing a degradation in performance. Such parallelism could be more eeciently controlled if parallel algorithmic structures (or skeletons) are used in the design of algorithms. A structure captures the...
متن کاملSCL-chan: An Asynchronous Data-Parallel Language for Irregular Algorithms
Parallelism suffers from a lack of programming languages both simple to handle and able to take advantage of the power of present parallel computers. If parallelism expression is too high level, compilers have to perform complex optimizations leading often to poor performances. One the other hand, too low level parallelism transfers difficulties toward the programmer. In this paper, we propose ...
متن کاملA Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbers of simple transformation rules to a representation of a functional program (serving as a specification) to produce an equivalent efficient imperative program. The simplicity of the transformation rules ensures that ...
متن کاملA pipelined code mapping scheme for static data flow computers
Computers built on data Ilow principles promise efficient parallel computation limited in speed only by data dependencies in the calculation being performed. We demonstrate how the massive parallelism of array operations in numerical scientific computation programs can be effectively exploited by the fine-grain parallelism of static data flow architecture. The power of such fine-grain paralleli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994